KOOL: An Application of Rewriting Logic to Language Prototyping and Analysis
نویسندگان
چکیده
This paper presents KOOL, a concurrent, dynamic, objectoriented language defined in rewriting logic. KOOL has been designed as an experimental language, with a focus on making the language easy to extend. This is done by taking advantage of the flexibility provided by rewriting logic, which allows for the rapid prototyping of new language features. An example of this process is illustrated by sketching the addition of synchronized methods. KOOL also provides support for program analysis through language extensions and the underlying capabilities of rewriting logic. This support is illustrated with several examples.
منابع مشابه
A Rewriting-Based Approach to OO Language Prototyping and Design
This paper introduces a framework for the rapid prototyping of object oriented programming languages. This framework is based on specifying the semantics of a language using term rewriting and a continuation-based representation of control. The notation used, called K, has been developed specifically for programming languages to overcome limitations in more general rewriting notation, and provi...
متن کاملOn Formal Analysis of OO Languages Using Rewriting Logic: Designing for Performance
Rewriting logic provides a powerful, flexible mechanism for language definition and analysis. This flexibility in design can lead to problems during analysis, as different designs for the same language feature can cause drastic differences in analysis performance. This paper describes some of these design decisions in the context of KOOL, a concurrent, dynamic, object-oriented language. Also de...
متن کاملPractical Techniques for Language Design and Prototyping
Global computing involves the interplay of a vast variety of languages, but practially useful foundations for language specification and prototyping at the semantic level are lacking. In this paper we present a systematic approach consisting of three techniques: 1. A generic calculus of explicit substitutions with names (called CINNI) that allows us to give a first-order representation of synta...
متن کاملIntegrating and Rapid-Prototyping UML Structural and Behavioural Diagrams Using Rewriting Logic
Although the diversity of UML diagrams provides users with different views of any complex software under development, in most cases system designers face challenging problems to keeping such diagrams coherently related. In this paper we propose to contribute to the tremendous efforts being undertaken towards rigorous and coherent views of UML-based modelling techniques. In this sense, we propos...
متن کاملCHR(PRISM)-based probabilistic logic learning
PRISM is an extension of Prolog with probabilistic predicates and built-in support for expectation-maximization learning. Constraint Handling Rules (CHR) is a high-level programming language based on multi-headed multiset rewrite rules. In this paper, we introduce a new probabilistic logic formalism, called CHRiSM, based on a combination of CHR and PRISM. It can be used for high-level rapid pro...
متن کامل